minimax polynomial - definitie. Wat is minimax polynomial
Diclib.com
Woordenboek ChatGPT
Voer een woord of zin in in een taal naar keuze 👆
Taal:

Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie

Wat (wie) is minimax polynomial - definitie

METHOD TO FIND AN APPROXIMATION OF A MATHEMATICAL FUNCTION THAT MINIMIZES MAXIMUM ERROR
L∞ approximation; Minimax polynomial; Uniform approximation algorithm

Minimax approximation algorithm         
A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error.
Minimax theorem         
THEOREM PROVIDING CONDITIONS THAT GUARANTEE THAT THE MAX–MIN INEQUALITY IS ALSO AN EQUALITY
Von Neumman's minimax theorem
In the mathematical area of game theory, a minimax theorem is a theorem providing conditions that guarantee that the max–min inequality is also an equality.
HOMFLY polynomial         
TWO-VARIABLE KNOT POLYNOMIAL, GENERALIZING THE JONES AND ALEXANDER POLYNOMIALS
HOMFLY(PT) polynomial; HOMFLY; LYMPHTOFU polynomial; HOMFLYPT polynomial; Homfly polynomial; FLYPMOTH polynomial; HOMFLY invariant
In the mathematical field of knot theory, the HOMFLY polynomial or HOMFLYPT polynomial, sometimes called the generalized Jones polynomial, is a 2-variable knot polynomial, i.e.

Wikipedia

Minimax approximation algorithm

A minimax approximation algorithm (or L approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error.

For example, given a function f {\displaystyle f} defined on the interval [ a , b ] {\displaystyle [a,b]} and a degree bound n {\displaystyle n} , a minimax polynomial approximation algorithm will find a polynomial p {\displaystyle p} of degree at most n {\displaystyle n} to minimize

max a x b | f ( x ) p ( x ) | . {\displaystyle \max _{a\leq x\leq b}|f(x)-p(x)|.}